On simple matrix languages versus scattered context languages
نویسندگان
چکیده
منابع مشابه
On Context-Free Languages of Scattered Words
It is known that if a Büchi context-free language (BCFL) consists of scattered words, then there is an integer n, depending only on the language, such that the Hausdorff rank of each word in the language is bounded by n. Every BCFL is a Müller context-free language (MCFL). In the first part of the paper, we prove that an MCFL of scattered words is a BCFL iff the rank of every word in the langua...
متن کاملSimple Matrix Languages
It is shown that £t(1)[~(l)] coincides with the class of context-free languages [regular sets] and that ~9' is a proper subset of the family of languages accepted by deterministic linear bounded automata, It is proved that ~(n)[~(n)] forms a hierarchy of classes of languages in ~9°[~]. The closure properties and decision problems associated with ,9°(n), ,.9", ,~(n), and ~ are thoroughly investi...
متن کاملA Homomorphic Representation of Simple Matrix Languages
In this paper we continue the investigation of simple matrix languages introduced by Ibarra (1970) as a subfamily of matrix languages. Simple matrix languages have many properties similar to those of context-free languages. In the following, we prove that every simple matrix language can be written as a homomorphic image of the intersection of the Dyck context-free language and an equal matrix ...
متن کاملOn Commutative Context-Free Languages
Let C = {a,, a2, . . . . a,} be an alphabet and let LcZ* be the commutative image of FP* where F and P are finite subsets of Z*. If, for any permutation c of { 1,2, . . . . n}, L n a&) a%, is context-free, then L is context-free. This theorem provides a solution to the Fliess conjecture in a restricted case. If the result could be extended to finite unions of the FP* above, the Fliess conjectur...
متن کاملOn strongly context-free languages
Starting from the question (inspired by the so-called computing by carving, from the DNA-based computing area) \which is easier to generate, a language or its complement?", we brie y investigate the context-free languages whose complements are also context-free. We call them strongly context-free languages. After examining the closure properties of the family of strongly context-free languages,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO. Informatique théorique
سال: 1982
ISSN: 0399-0540
DOI: 10.1051/ita/1982160302451